Universality of group embeddability
نویسندگان
چکیده
منابع مشابه
Universality of Embeddability Relations for Coloured Total Orders
Some examples of Σ 1 1-universal preorders are presented, in the form of various relations of embeddability between countable coloured total orders. As an application, strengthening a theorem of [7], the Σ 1 1-universality of continuous embeddability for dendrites whose branch points have order 3 is obtained.
متن کاملUniversality and the renormalisation group
Several functional renormalisation group (RG) equations including Polchinski flows and Exact RG flows are compared from a conceptual point of view and in given truncations. Similarities and differences are highlighted with special emphasis on stability properties. The main observations are worked out at the example of O(N) symmetric scalar field theories where the flows, universal critical expo...
متن کاملEmbeddability of the combinohedron
Let e1; : : : ; em be m di#erent symbols, let r1¿ · · ·¿ rm be positive integers, and let n= ∑m i=1 ri. The combinohedron, denoted by C(r1; : : : ; rm), is the loopless graph whose vertices are the n-tuples in which the symbol ei appears exactly ri times, and where an edge joins two vertices if and only if one can be transformed into the other by interchanging two adjacent entries. The graph kn...
متن کاملOn stable embeddability of partitions
Several natural partial orders on integral partitions, such as the embeddability, the stable embeddability, the bulk embeddability and the supermajorization, raise in the quantum computation, bin-packing and matrix analysis. We find the implications between these partial orders. For integral partitions whose entries are all powers of a fixed number p, we show that the embeddability is completel...
متن کاملUpward Point-Set Embeddability
We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph D has an upward planar embedding into a point set S. We show that any switch tree admits an upward planar straight-line embedding into any convex point set. For the class of k-switch trees, that is a generalization of switch trees (according to this definition a switch t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2017
ISSN: 0002-9939,1088-6826
DOI: 10.1090/proc/13857